%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : PUZ082^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 13:14:41 EDT 2023

% Result   : Theorem 4.01s 4.23s
% Output   : Proof 4.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : PUZ082^1 : TPTP v8.1.2. Released v3.6.0.
% 0.12/0.14  % Command    : duper %s
% 0.13/0.35  % Computer : n003.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.20/0.35  % DateTime   : Sat Aug 26 22:44:24 EDT 2023
% 0.20/0.35  % CPUTime    : 
% 4.01/4.23  SZS status Theorem for theBenchmark.p
% 4.01/4.23  SZS output start Proof for theBenchmark.p
% 4.01/4.23  Clause #0 (by assumption #[]): Eq (says peter (∀ (X : Prop), says peter X → Not X)) True
% 4.01/4.23  Clause #1 (by assumption #[]): Eq (Not (Not (∀ (X : Prop), says peter X → Not X))) True
% 4.01/4.23  Clause #2 (by clausification #[1]): Eq (Not (∀ (X : Prop), says peter X → Not X)) False
% 4.01/4.23  Clause #3 (by clausification #[2]): Eq (∀ (X : Prop), says peter X → Not X) True
% 4.01/4.23  Clause #4 (by clausification #[3]): ∀ (a : Prop), Eq (says peter a → Not a) True
% 4.01/4.23  Clause #5 (by clausification #[4]): ∀ (a : Prop), Or (Eq (says peter a) False) (Eq (Not a) True)
% 4.01/4.23  Clause #6 (by clausification #[5]): ∀ (a : Prop), Or (Eq (says peter a) False) (Eq a False)
% 4.01/4.23  Clause #7 (by identity loobHoist #[6]): ∀ (a : Prop), Or (Eq a False) (Or (Eq (says peter True) False) (Eq a False))
% 4.01/4.23  Clause #9 (by eliminate duplicate literals #[7]): ∀ (a : Prop), Or (Eq a False) (Eq (says peter True) False)
% 4.01/4.23  Clause #10 (by falseElim #[9]): Eq (says peter True) False
% 4.01/4.23  Clause #11 (by bool simp #[0]): Eq (says peter (And (says peter True → Not True) (says peter False → Not False))) True
% 4.01/4.23  Clause #12 (by bool simp #[11]): Eq (says peter (And (says peter True → Not True) (says peter False → True))) True
% 4.01/4.23  Clause #13 (by bool simp #[12]): Eq (says peter (And (says peter True → Not True) True)) True
% 4.01/4.23  Clause #14 (by bool simp #[13]): Eq (says peter (says peter True → Not True)) True
% 4.01/4.23  Clause #15 (by bool simp #[14]): Eq (says peter (says peter True → False)) True
% 4.01/4.23  Clause #16 (by bool simp #[15]): Eq (says peter (Not (says peter True))) True
% 4.01/4.23  Clause #17 (by forward demodulation #[16, 10]): Eq (says peter (Not False)) True
% 4.01/4.23  Clause #18 (by bool simp #[17]): Eq (says peter True) True
% 4.01/4.23  Clause #19 (by superposition #[18, 10]): Eq True False
% 4.01/4.23  Clause #20 (by clausification #[19]): False
% 4.01/4.23  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------